Decision problems resulting from grammatical inference

Ten Open Problems in Grammatical Inference

We propose 10 different open problems in the field of grammatical inference. In all cases, problems are theoretically oriented but correspond to practical questions. They cover the areas of polynomial learning models, learning from ordered alphabets, learning deterministic Pomdps, learning negotiation processes, learning from context-free background knowledge.

Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems

Empirical grammatical inference systems are practical systems that learn structure from sequences, in contrast to theoretical grammatical inference systems, which prove learnability of certain classes of grammars. All current empirical grammatical inference evaluation methods are problematic, i.e. dependency on language experts, appropriateness and quality of an underlying grammar of the data, ...

Regular Grammatical Inference from Positive andNegative Samples

We recall brieey in this paper the formal theory of regular grammatical inference from positive and negative samples of the language to be learned. We state this problem as a search toward an optimal element in a boolean lattice built from the positive information. We explain how a genetic search technique may be applied to this problem and we introduce a new set of genetic operators. In view o...

Grammatical Inference of Colonies

A concept of accepting colonies is introduced. A hybrid connectionist-symbolic architecture (\neural pushdown automaton") for inference of colonies based on presentation of positive and negative examples of strings is then described, together with an algorithm for extracting a colony from trained neural network. Some examples of the inference of colonies gener-ating/accepting simple context-fre...

Grammatical inference as unification